n=int(input())
C=[]
l=[]
for ii in range(n):
a,b=input().split()
l.append([a,b])
x,y,c=l[0][0],l[0][1],0
for i in range(0,n):
if([x,y]!=l[i]):
C.append(c)
c=1
x,y=l[i][0],l[i][1]
else:
c+=1
C.append(c)
print(max(C))#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll M=1e9+7;
void solve(){
map<ll,ll>mp;
ll n;
cin>>n;
ll ans = 0;
while(n--){
ll x,y;
cin>>x>>y;
ll num = x*60 + y;
mp[num]++;
ans = max(ans,mp[num]);
}
cout<<ans<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t=1;
// ll t;
// cin>>t;
// ll T=t;
// while(t--){
// // cout<<"Case #"<<T-t<<": ";
// if(solve()){
// cout <<"Yes" <<endl;
// }
// else{
// cout<<"No"<<endl;
// }
// }
while(t--){
// cout << fixed << setprecision(9)<<solve()<<endl;
solve();
// cout<<solve()<<endl;
}
return 0;
} 318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |
345. Reverse Vowels of a String | 628. Maximum Product of Three Numbers |
1526A - Mean Inequality | 1526B - I Hate 1111 |
1881. Maximum Value after Insertion | 237. Delete Node in a Linked List |
27. Remove Element | 39. Combination Sum |
378. Kth Smallest Element in a Sorted Matrix | 162. Find Peak Element |
1529A - Eshag Loves Big Arrays | 19. Remove Nth Node From End of List |
925. Long Pressed Name | 1051. Height Checker |
695. Max Area of Island | 402. Remove K Digits |
97. Interleaving String | 543. Diameter of Binary Tree |
124. Binary Tree Maximum Path Sum | 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
501A - Contest | 160A- Twins |